搜索资源列表
maze dfs
- dfs 深度优先搜索!这是走迷宫的基本算法。用广义表建立迷宫,用邻接表建立图,用dfs搜索,许多大学的数据结构作业-dfs depth-first search! Maze This is the basic algorithm. Generalized Table established maze, with the establishment of the adjacent table map, with dfs search, the University of many data str
图搜索策略
- 一个使用Java实现的人工智能的图搜索策略程序——酒九宫图问题 人工智能-图搜索策略-演示程序-使用说明 程序简介 在人工智能领域,对隐式图的搜索是求解问题的一种基本方法,本程序通过使用多种图搜索策略,对 重排九宫问题进行求解,演示了“广度优先搜索”、“深度优先搜索”、“有界深度优先搜索”、 “最好优先搜索”和“局部择优搜索”五种基本的图图搜索策略。 整个程序使用了动画技术,界面设计美观友好,使用方便。-use a Java artificial intelligence plans Searc
图深度优先
- 图的深度优先算法动态演示,用到了直线的中点绘制算法-map algorithm for dynamic priority depth demonstration of the use of linear midpoint Rendering Algorithm
图的操作界面
- 图邻接表的建立,深度优先遍历,.广度优先遍历,最小生成树,拓扑排序,单源点到其余各个顶点的最短路径等对图的操作!VC界面!-plans to establish the adjacent table, depth-first traversal. Breadth priority traversal, the minimum spanning tree, topological sorting, single-source all of the rest of the vertices such
深度优先搜索、广度优先搜索
- 图的深度优先搜索和广度优先搜索。值得一看。-map the depth-first search and breadth - first search. An eye-catcher.
0801
- 功能:构造图,并进行图的深度优先遍历(邻接表存储结构),图的广度优先遍历,内附详尽的源代码说明-function : tectonic map, and map depth-first traversal of the (storage structure adjacent table), the breadth of the plan priority traversal, enclosing a detailed note of the source code
5班8号周前平
- 输入一个有向图,用深度优先搜索,判断该图是否为一有圈的图。-importation of a directed graph, with the depth-first search to determine whether the plan is a map of the circle.
两种遍历图的方法
- 熟悉图的两种常用的存储结构,以及在这两种存储结构上的两种遍历图的方法,即深 度优先遍历和广度优先遍历。进一步掌握递归算法的设计方法。 -familiar with the plans of two commonly used storage structure, and the two storage structures on the two traverse map, that depth-first traversal and breadth priority traversal.
FSofGragh
- 图论中关于简单无向图的深度,广度搜索,由图形界面简单方便的演示。-on graph theory to a simple map with the breadth, depth search by the graphical interface is simple and convenient to the demonstration.
sortling
- 实现图的脱坡排序,深度优先广度优先,以及建立邻接表-achieve slope from the map, in order of priority depth breadth priority, and the establishment of the adjacent table
linsang
- 很多涉及图上操作的算法都是以图的遍历操作为基础的,此程序演示出图的遍历的过程。通过邻接矩阵存储结构实现数据俄的输入,实现图的深度优先遍历和广度优先遍历过程的演示,对异常输入信息报错。-map of algorithms are plans to traverse the basis for the operation, this procedure demonstrated map out the ergodic process. Through the adjacency matrix of
graphshguang
- 图的深度优先遍历和广度优先遍历,以邻接矩阵方式输入。(按照提示输入)! -map the depth and breadth traversal priority priority traverse to the adjacency matrix input. (According to the prompt entry)!
tubianli
- 以邻接表为存储结构,实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点,分别输出每种遍历下的结点访问序列和相应生成树的边集。-table adjacent to the structure for storage, connectivity to the map without the depth and breadth of priority priority traversal. Users designated as a starting point node, the out
graphSearch
- 实现了图的搜索算法,包括深度优先搜索,广度优先搜索,Dijstra算法,A*算法等较典型的搜索算法,同时可以进行图的输入和编辑等操作,仅供大家参考。-achieve the plan's search algorithm, including depth-first search, breadth - first search algorithm Dijstra, A * algorithm is more typical search algorithm, and can map th
GraphMatrix
- 以邻接矩阵作为图的存储结构,根据键盘输入创建图,并深度优先、广度优先遍历该图-matrix as to the adjacent storage structure of the plan, according to the keyboard input to create map and depth of priority, breadth priority traversal of the plan
GOOD_DFS_BFS
- 图论中二种遍历图的算法.深度优先遍历,与广度优先遍历.-graph theory two species traverse map algorithm. Depth-first traversal, and the breadth - first traversal.
BFS_DFS_Astar
- Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The firs
MyDraw_new
- 功能:用面向对象的思想来实现了对直线 矩形 椭圆三种图元的绘制 选定 移动 并添加了编辑设置图元多种属性功能 是深入学习GDI编程很好的例子-functions : Object-oriented thinking to achieve a pair of three straight rectangular oval map of the selected mobile mapping and add a map editor Set Attribute function of a varie
Diagram
- 图的操作,包括,图的基本存储方法,有关图的操作算法并用C语言编程实现,图的搜索路径的遍历方法,以邻接矩阵和邻接表的方式存储连通图。然后分别用优先深度算法遍历邻接矩阵方式存储的图和邻接表方式存储的图。深度优先遍历的递归算法 (1)深度优先遍历算法(2)邻接表表示的深度优先搜索算法(3)邻接矩阵表示的深度优先搜索算法.-plan of operation, including, map the basic storage methods, the operation of the map algor
zhljrj
- 综合录井图软件源代码,要点:深度图形驱动。-Mudlogging map software source code, key points : Depth Graphics Drivers.